منابع مشابه
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to vertices at both ends, and these unconnected ends can be interpreted as the inputs and outputs of a diagram. In this paper, we give a concrete construction for str...
متن کاملOn GS-Monoidal Theories for Graphs with Nesting
We propose a sound and complete axiomatisation of a class of graphs with nesting and either locally or globally restricted nodes. Such graphs allow to represent explicitly and at the right level of abstraction some relevant topological and logical features of models and systems, including nesting, hierarchies, sharing of resources, and pointers or links. We also provide an encoding of the propo...
متن کاملOn Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs
Compositional graph models for global computing systems must account for two relevant dimensions, namely nesting and linking. In Milner’s bigraphs the two dimensions are made explicit and represented as loosely coupled structures: the place graph and the link graph. Here, bigraphs are compared with an earlier model, gs-graphs, based on gs-monoidal theories and originally conceived for modelling...
متن کاملBinding bigraphs as symmetric monoidal closed theories
We reconstruct Milner’s [1] category of abstract binding bigraphs Bbg(K) over a signature K as the free (or initial) symmetric monoidal closed (smc) category S(TK) generated by a derived theory TK. The morphisms of S(TK) are essentially proof nets from the Intuitionistic Multiplicative fragment (imll) of Linear Logic [2]. Formally, we construct a faithful, essentially injective on objects funct...
متن کاملSymbolic protocol analysis for monoidal equational theories
We consider the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we take into account some algebraic properties satisfied by the operators involved in the protocol. This leads to a more realistic model than what we get under the perfect cryptography assumption, but it implies that protocol analy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2013
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129512000138